On the Reformulation of Vehicle Routing Problems and Scheduling Problems
نویسندگان
چکیده
We can reformulate a vehicle routing problem (VRP) as an open shop scheduling problem (SSP) by representing visits as activities, vehicles as resources on the factory floor, and travel as set up costs between activities. In this paper we present two reformulations: from VRP to open shop, and the inverse, from SSP to VRP. Not surprisingly, VRP technology performs poorly on reformulated SSP’s, as does scheduling technology on reformulated VRP’s. We present a pre-processing transformation that “compresses” the VRP, transforming an element of travel into the duration of the visits. The compressed VRP’s are then reformulated as scheduling problem, to determine if it is primarily distance in the VRP that causes scheduling technology to degrade on the reformulated problem. This is a step towards understanding the features of a problem that make it more amenable to one technology rather than another.
منابع مشابه
The Special Application of Vehicle Routing Problem with Uncertainty Travel Times: Locomotive Routing Problem
This paper aims to study the locomotive routing problem (LRP) which is one of the most important problems in railroad scheduling in view of involving expensive assets and high cost of operating locomotives. This problem is assigning a fleet of locomotives to a network of trains to provide sufficient power to pull them from their origins to destinations by satisfying a rich set of operational con...
متن کاملA multi-product vehicle routing scheduling model with time window constraints for cross docking system under uncertainty: A fuzzy possibilistic-stochastic programming
Mathematical modeling of supply chain operations has proven to be one of the most complex tasks in the field of operations management and operations research. Despite the abundance of several modeling proposals in the literature; for vast majority of them, no effective universal application is conceived. This issue renders the proposed mathematical models inapplicable due largely to the fact th...
متن کاملA Comparison of NSGA II and MOSA for Solving Multi-depots Time-dependent Vehicle Routing Problem with Heterogeneous Fleet
Time-dependent Vehicle Routing Problem is one of the most applicable but least-studied variants of routing and scheduling problems. In this paper, a novel mathematical formulation of time-dependent vehicle routing problems with heterogeneous fleet, hard time widows and multiple depots, is proposed. To deal with the traffic congestions, we also considered that the vehicles are not forced to come...
متن کاملSupply Chain Scheduling Using a Transportation System Composed of Vehicle Routing Problem and Cross-Docking Approaches
This study considers a combination of cross-docking and vehicle routing problem (VRP) approachesto transport raw material and parts in a supply chain. The supply chain is composed of some supplierswhich are spread in different geographical zones and multiple shared vehicles with different speedsand capacities for transporting orders from the suppliers to a manufacturer. After ...
متن کاملAn Improved Particle Swarm Optimization for a Class of Capacitated Vehicle Routing Problems
Vehicle Routing Problem (VRP) is addressed to a class of problems for determining a set of vehicle routes, in which each vehicle departs from a given depot, serves a given set of customers, and returns back to the same depot. On the other hand, simultaneous delivery and pickup problems have drawn much attention in the past few years due to its high usage in real world cases. This study, therefo...
متن کاملA case study of mutual routing-scheduling reformulation
Classical models of combinatorial problems, such as scheduling, play a key role in optimization research as they allow theoretical and empirical work to focus on core issues of problem solving performance. By their very nature, however, classical models are a simplification of real-world problems. We argue that the challenge now is to address those real-world features that were simplified away ...
متن کامل